Subspace packings: constructions and bounds
نویسندگان
چکیده
منابع مشابه
Constructions and bounds for mixed-dimension subspace codes
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called Main Problem of Subspace Coding is to determine the maximum size Aq(v, d) of a code in PG(v−1,Fq) with minimum subspace distance d. Here we completely resolve this problem for d ≥ v − 1. For d = v − 2 we present some improved bounds ...
متن کاملSeparating Codes: Constructions and Bounds
Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.
متن کاملConstructions of uniform designs by using resolvable packings and coverings
In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.
متن کاملNew Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملNew Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2020
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-020-00732-z